Level Set Structure of an Integrable Cellular Automaton
نویسندگان
چکیده
منابع مشابه
Level Set Structure of an Integrable Cellular Automaton
Based on a group theoretical setting a sort of discrete dynamical system is constructed and applied to a combinatorial dynamical system defined on the set of certain Bethe ansatz related objects known as the rigged configurations. This system is then used to study a one-dimensional periodic cellular automaton related to discrete Toda lattice. It is shown for the first time that the level set of...
متن کاملthe underlying structure of language proficiency and the proficiency level
هدف از انجام این تخقیق بررسی رابطه احتمالی بین سطح مهارت زبان خارجی (foreign language proficiency) و ساختار مهارت زبان خارجی بود. تعداد 314 زبان آموز مونث و مذکر که عمدتا دانشجویان رشته های زبان انگلیسی در سطوح کارشناسی و کارشناسی ارشد بودند در این تحقیق شرکت کردند. از لحاظ سطح مهارت زبان خارجی شرکت کنندگان بسیار با هم متفاوت بودند، (75 نفر سطح پیشرفته، 113 نفر سطح متوسط، 126 سطح مقدماتی). کلا ...
15 صفحه اولWhat subshifts are the limit set of a cellular automaton?
Cellular automata are the most natural discretization of dynamical systems. Their long-term behaviour is captured in their limit set, also known as the maximal attractor. We investigate what complexity limit sets can have from the point of view of language theory, and we try to give some dynamical characterizations of subshifts that are limit sets. Then, the inverse problem of determining the l...
متن کاملFast Cellular Automaton tracker for the ALICE High Level Trigger
The algorithm combines a Cellular Automaton method [1], which is used for a fast pattern recognition, and the Kalman filter method [2], which performs a fit of found trajectories and the final track selection. The algorithm has proved its high performance (99.9% for the proton-proton events and 95.8% for the central Pb-Pb collisions) in comparison with the off-line reconstruction (99.9% and 98....
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry, Integrability and Geometry: Methods and Applications
سال: 2010
ISSN: 1815-0659
DOI: 10.3842/sigma.2010.027